The complete mixability and convex minimization problems with monotone marginal densities
نویسندگان
چکیده
Following the results in Rüschendorf and Uckelmann (2002), we introduce the completely mixable distributions on R and prove that distributions with monotone density and moderate mean are completely mixable. Using this method we solve the minimization problem minXi∼P Ef(X1 + · · ·+ Xn) for convex functions f and marginal distributions P with monotone density. Our results also provide valuable implications in variance minimization, bounds for the sum of random variables and risk theory. Key-words: complete mixability; variance minimization; multivariate dependence; monotone densities; optimal coupling.
منابع مشابه
Bounds for the sum of dependent risks and worst Value-at-Risk with monotone marginal densities
In quantitative risk management, it is important and challenging to find sharp bounds for the distribution of the sum of dependent risks with given marginal distributions, but an unspecified dependence structure. These bounds are directly related to the problem of obtaining the worst Value-at-Risk of the total risk. Using the idea of the complete mixability, we provide a new lower bound for any...
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کاملW-convergence of the proximal point algorithm in complete CAT(0) metric spaces
In this paper, we generalize the proximal point algorithm to complete CAT(0) spaces and show that the sequence generated by the proximal point algorithm $w$-converges to a zero of the maximal monotone operator. Also, we prove that if $f: Xrightarrow ]-infty, +infty]$ is a proper, convex and lower semicontinuous function on the complete CAT(0) space $X$, then the proximal...
متن کاملDecomposition Techniques for Bilinear Saddle Point Problems and Variational Inequalities with Affine Monotone Operators
The majority of First Order methods for large-scale convex-concave saddle point problems and variational inequalities with monotone operators are proximal algorithms which at every iteration need to minimize over problem’s domain X the sum of a linear form and a strongly convex function. To make such an algorithm practical, X should be proximal-friendly – admit a strongly convex function with e...
متن کاملEstimation of a K − Monotone Density , Part 1 : Characterizations , Consistency , and Minimax Lower
Shape constrained densities are encountered in many nonparametric estimation problems. The classes of monotone or convex (and monotone) densities can be viewed as special cases of the classes of k−monotone densities. A density g is said to be k−monotone if (−1)g is nonnegative, nonincreasing and convex for l = 0, . . . , k−2 if k ≥ 2, and g is simply nonincreasing if k = 1. These classes of sha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Multivariate Analysis
دوره 102 شماره
صفحات -
تاریخ انتشار 2011